Non-crossing Knight’s Tour in 3-Dimension
نویسنده
چکیده
Non-crossing knight‟s tour in 3-dimension is a new field of research. The author has shown its possibility in small cuboids and in cubes up to 8x8x8 size. It can also be extended to larger size cubes and cuboids. The author has achieved jumps of length 15, 46, 88, 159, 258 and 395 in cubes of size 3x3x3, 4x4x4, 5x5x5, 6x6x6, 7x7x7 and 8x8x8 respectively. This amounts to covering 59%, 73%, 71%, 74%, 76% and 77% cells in these cubes.
منابع مشابه
An Efficient Algorithm for the Knight's Tour Problem
A knight’s tour is a series of moves made by a knight visiting every square of an n x n chessboard exactly once. The knight’s tour problem is the problem of constructing such a tour, given n. A knight’s tour is called closed if the last square visited is also reachable from the first square by a knight’s move, and open otherwise. Define the knight’s graph for an n x n chessboard to be the graph...
متن کاملExperimental Results on Hamiltonian-Cycle-Finding Algorithms
Frieze [1] introduced a heuristic polynomial-time algorithm, Ham, for finding Hamiltonian cycles in random graphs with high probability. We wanted to see how this algorithm performs in practice, and whether it could be improved by modifying it. For this purpose, we borrowed an idea from an algorithm by Keydar called SemiHam [2]. SemiHam is a modification of Ham that finds Hamiltonian cycles in ...
متن کاملWhich Chessboards have a Closed Knight's Tour within the Rectangular Prism?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. In 1991 Schwenk completely classified the m × n rectangular chessboards that admit a closed knight’s tour. In honor of the upcoming twentieth anniversary of the publication of Schwenk’s paper, this article extends his result by classifying the i × j × k r...
متن کاملKnight's Tours in Higher Dimensions
In this paper we are concerned with knight’s tours on high-dimensional boards. Our main aim is to show that on the d-dimensional board [n], with n even, there is always a knight’s tour provided that n is sufficiently large. In fact, we give an exact classification of the grids [n1] × . . . × [nd] in which there is a knight’s tour. This answers questions of DeMaio, DeMaio and Mathew, and Watkins.
متن کاملWhich Chessboards have a Closed Knight's Tour within the Cube?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated into graph theoretic terms the question is transformed into the existence of a Hamiltonian cycle. There are two common tours to consider on the cube. One is to tour the six exterior n × n boards that form the cube. The ot...
متن کامل